Single machine scheduling with small operator-non-availability periods

Single machine scheduling with small operator-non-availability periods

Through an industrial application, we were confronted with the planning of experiments where human intervention of a chemists is required to handle the starting and termination. This gives rise to a new type of scheduling problems, namely problems of finding schedules with time periods when the tasks can neither start nor finish. We consider in this paper the natural case of small periods where...

Operator non-availability periods

In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the week-ends, holidays, vacations) where the chemists are not available. However, human intervention by the chemists is required to handle the starting and termination of the experiments. This gives rise to ...

Study of Scheduling Problems with Machine Availability Constraint

In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...

Single-machine Scheduling with Splitable Jobs and Availability Constraints

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computati...

Scheduling with limited machine availability